Limiting removal depth in the Pushout scheme for ATM networks”, Icc ’92, pp.9971003. Yi-Bing

ATM network handles cells of different classes in various ways in order to provide the different services with their respective QoS (Quality of Service) requirements. A possible way to provide this is to use buffers in nodes by giving priority to cells relating to the most demanding bearer capability. When time priority is used, the next cell to be transmitted, if more then one is waiting in a queue, is the one with highest priority. In order to decrease the loss probability of high priority cells at the expense of cells with lower priorities, two loss priority schemes have been proposed in literature: Threshold and Push out. Since throughput is slightly greater in the push out scheme while buffer management complexity increases when passing from threshold to push out, it seems natural to prefer the threshold scheme.In this paper a limiting removal depth in push out scheme called L push out, is proposed. The most attractive feature in limiting push out, is the decreasing of buffer management complexity since only a small part of the buffer seems to be necessary to reach both loss rates using the push out strategy.Approximation analysis was used for random traffic and simulations for bursty traffk. 1